Recent Progress in Algebraic Combinatorics
نویسنده
چکیده
We survey three recent breakthroughs in algebraic combinatorics. The first is the proof by Knutson and Tao, and later Derksen and Weyman, of the saturation conjecture for Littlewood-Richardson coefficients. The second is the proof of the n! and (n + 1)n−1 conjectures by Haiman. The final breakthrough is the determination by Baik, Deift, and Johansson of the limiting behavior of the length of the longest increasing subsequence of a random permutation.
منابع مشابه
Recent Advances in Algebraic and Enumerative Combinatorics
Algebraic and enumerative combinatorics is concerned with objects that have both a combinatorial and an algebraic interpretation. It is a highly active area of the mathematical sciences, with many connections and applications to other areas, including algebraic geometry, representation theory, topology, mathematical physics and statistical mechanics. Enumerative questions arise in the mathemati...
متن کاملDegenerating Geometry to Combinatorics : Research Proposal for
A central appeal of algebraic geometry is that its functions are polynomials which can be written down as finite expressions. This makes the theory naturally combinatorial, in that polynomials are made up of a finite number of terms which interact through discrete rules. In practice, however, the operations performed on these polynomials are usually too complex for combinatorial methods to be o...
متن کاملUsing Ace, an Algebraic Combinatorics Environment for Maple
We present some examples using the ACE library devoted to Algebraic Combinatorics computations. This environment, divided into packages, provides a way to manipulate classical objects such as permutations, tableaux, symmetric functions and diierent algebras related to the symmetric group. One also nds more recent mathematical objects like noncommutative symmetric functions or Schubert polynomials.
متن کاملCoding Theory and Algebraic Combinatorics
This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings, kissing numbers, lattices, and association schemes. In particular, special interest is devoted to the relationship between codes and combinatorial designs. ...
متن کامل